Location:
Search - fft 1024
Search list
Description: 2812读取ADS8370的数据并用TI的库函数做1024点的FFT-2812 reads ADS8370 data and TI' s library functions to do with the 1024-point FFT
Platform: |
Size: 355328 |
Author: 张洁 |
Hits:
Description: 在carbide C++2.0下使用S60 3rd fp2的SDK编译通过并运行成功的1024point FFT IFFT工程，能够测试计算时间。-1024 point FFT IFFT on carbide C++
Platform: |
Size: 26624 |
Author: driedfish |
Hits:
Description: 用LPC2138做的07年电子设计大赛源码，基于ucos的1024点FFT。-Done in 2007 with the LPC2138 Electronic Design Contest source, based on ucos 1024-point FFT.
Platform: |
Size: 870400 |
Author: 鲍茂然 |
Hits:
Description: 使用FFT变换在频域对宽带扩频信号中的正弦干扰信号进行识别和抑制，其中扩频信号由1024点的伪随机序列表示。-In the frequency domain using the FFT transform of broadband spread-spectrum signal of sinusoidal interference signal identification and suppression, in which spread-spectrum signal is generated by pseudo-random sequence of 1024 points, said.
Platform: |
Size: 1024 |
Author: wanchun |
Hits:
Description: fft的c语言实现,本程序用c语言基于fft的实现方法可以实现1024长度的序列fft变换-fft of c language, c language using the program fft-based method can achieve the realization of the sequence length 1024 fft transform
Platform: |
Size: 2048 |
Author: mike |
Hits:
Description: 将声音文件在时间轴上分割成几段，分别将段的秩序及某些段内的秩序颠倒，从而实现了对声音文件的加密。首先，先读取一个声音信号，对信号做1024点FFT变换，取完点之后，分成四个向量，四个向量组成一个矩阵，再对每一个向量进行转置，再重新整合，从而就实现了回密的过程。-Sound files on the timeline will be divided into paragraphs, each paragraph of the order and reversed the order of some paragraphs to realize the encryption of sound files. First, the first reading of a voice signal, the signal was 1024 points FFT transform, check after the completion point, divided into four vectors, the four vectors form a matrix, then for each vector transpose, re-integration, which will achieve a return to close the process.
Platform: |
Size: 33792 |
Author: yuanyuan |
Hits:
Description: fpgafft 用 实现dsp 的fft算法 其中有几个文档文件和用vhdl写的1024点 代码-fpgafft dsp with the fft algorithm to achieve a number of documents including documents and written with a vhdl code for 1024 points
Platform: |
Size: 137216 |
Author: fengyike |
Hits:
Description: 本程序实现了定点1024点FFT，根据溢出位数进行动态Q值调整-This procedure implements fixed-point 1024 points FFT, according to the median overflow dynamically adjust the Q value
Platform: |
Size: 231424 |
Author: 于慕阳 |
Hits:
Description: 1024点时间基2抽取算法FFT。输出txt形式的自定义输入文件及FFT计算后输出的幅频特性-1024 time extraction algorithm based 2 FFT. Txt format output custom input file and output FFT calculated amplitude-frequency characteristics
Platform: |
Size: 211968 |
Author: 杨桂森 |
Hits:
Description: 这是一个简单的FFT为无电位1 +1 +1 Ð 薛定谔方程的光束传播方法。如果该软件灵活，允许引入的术语（如果是极少数需要包括色散效应高阶导数）。例如，如果一个人渴望解决的一个方程的形式：
（四/ dz的+ Ð ^ 2/dx ^ 2 - 0.25 * Ð ^ 3/dx ^ 3）== 0 Ÿ
它可以解决使用以下代码：
Ž = linspace（0,1,512）
x = linspace（-5,5,1024）
psi0 =进出口（- x的。^ 2）
Ð = D_lateral1D（十，2）-0.25 * D_lateral1D（十，3）
字段= LinearBPM（psi0，有D，Z）
凡D_lateral1D是一个函数，提供“取代”的微分算子。
这个函数是在一个非线性的BPM，我曾对（分步，谱方法等），将提交给我，当我完成他们的文件和组织功能更复杂的设置非常初期阶段。
-This is a simple FFT based beam propagation method for potential-free 1+1+1D Schrodinger equation. The software if flexible and allows to introduce high-order derivatives in the term (very handful if is needed to include dispersion effects). For example, if one desires to solve an equation in the form:
(d/dz+ d^2/dx^2- 0.25*d^3/dx^3)Y == 0
It can be solved using the following code:
z=linspace(0,1,512)
x=linspace(-5,5,1024)
psi0=exp(-x.^2)
D=D_lateral1D(x,2)-0.25*D_lateral1D(x,3)
field=LinearBPM(psi0,D,z)
Where D_lateral1D is a provided function that "replaces" the derivative operator.
This function is a very early stage in a more complex set of non-linear BPM functions that I have made (split-step, spectral methods, etc.) and I will submit them when I finish their documentation and organization.
Sorry for my English, I m eager for your comments.
Platform: |
Size: 2048 |
Author: zhou |
Hits:
Description: 1024点基2时分FFT快速傅立叶变换(vhdl)
-1024-point radix-2 FFT Fast Fourier transform peak (vhdl)
Platform: |
Size: 617472 |
Author: leo |
Hits:
Description: this module C that I wrote for FFT radix 2-2 1024 point.-this is module C that I wrote for FFT radix 2-2 1024 point.
Platform: |
Size: 37888 |
Author: Pon |
Hits:
Description: 在单片中实现的1024点的FFT运算，算法的实现是采用1024点的查表发。-Implemented in 1024 in a single point FFT computation, the algorithm implementation is made with 1024 points in the look-up table.
Platform: |
Size: 5120 |
Author: yinxiong |
Hits:
Description: 基于Danielson Lanczos算法 1024点FFT运算-Danielson Lanczos algorithm for fft
Platform: |
Size: 1024 |
Author: ogrex |
Hits:
Description: 适用于NIOS II的1024点FFT C算法- 1024-point FFT C algorithm for NIOS II
Platform: |
Size: 2048 |
Author: ogrex |
Hits:
Description: 1024点的FFT变换，很实用，用于单片机做快速傅立叶变换-1024-point FFT transform, it is practical, fast Fourier transform for the microcontroller to do
Platform: |
Size: 63488 |
Author: aguo |
Hits:
Description: 1024点FFT快速傅立叶变换(vhdl)-1024 point FFT in the FPGA enviroment
Platform: |
Size: 18432 |
Author: zhanglili |
Hits:
Description: 用verilog编写的1024点的fft快速傅立叶变换-Written in 1024 by verilog point fast Fourier transform fft
Platform: |
Size: 12288 |
Author: yangyang |
Hits:
Description: STM32的DSP库，包括64点，256点，1024点FFT和PID控制算法-The STM32 DSP library, including 64 points, 256 points, 1024 points FFT and the PID control algorithm
Platform: |
Size: 1980416 |
Author: 王冲 |
Hits:
Description: FFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-FFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 153600 |
Author: |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
»